On Generalized Moore Digraphs
Identifieur interne : 000181 ( LNCS/Analysis ); précédent : 000180; suivant : 000182On Generalized Moore Digraphs
Auteurs : Michael Sampels [Belgique]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Abstract
Abstract: The transmission of a strongly connected digraph D is defined as the sum of all distances in D. A lower bound for the transmission in terms of the order n and the maximal outdegree Δ + of D can be regarded as a generalization of the Moore bound for digraphs. Bridges and Toueg showed that Moore digraphs in the strong sense exist only for the trivial cases Δ + =1 or Δ + =n-1. Using techniques founded on Cayley digraphs, we constructed vertex-symmetric generalized Moore digraphs. Such graphs are applicable to interconnection networks of parallel computers, routers, switches, backbones, etc.
Url:
DOI: 10.1007/978-3-540-24669-5_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000825
- to stream Istex, to step Curation: 000775
- to stream Istex, to step Checkpoint: 000967
- to stream Main, to step Merge: 001A88
- to stream Main, to step Curation: 001897
- to stream Main, to step Exploration: 001897
- to stream LNCS, to step Extraction: 000181
Links to Exploration step
ISTEX:80C13B196A6A102A54B8001200A112FD1D9D69A1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On Generalized Moore Digraphs</title><author><name sortKey="Sampels, Michael" sort="Sampels, Michael" uniqKey="Sampels M" first="Michael" last="Sampels">Michael Sampels</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:80C13B196A6A102A54B8001200A112FD1D9D69A1</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-24669-5_6</idno><idno type="url">https://api.istex.fr/document/80C13B196A6A102A54B8001200A112FD1D9D69A1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000825</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000825</idno><idno type="wicri:Area/Istex/Curation">000775</idno><idno type="wicri:Area/Istex/Checkpoint">000967</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000967</idno><idno type="wicri:doubleKey">0302-9743:2004:Sampels M:on:generalized:moore</idno><idno type="wicri:Area/Main/Merge">001A88</idno><idno type="wicri:Area/Main/Curation">001897</idno><idno type="wicri:Area/Main/Exploration">001897</idno><idno type="wicri:Area/LNCS/Extraction">000181</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On Generalized Moore Digraphs</title><author><name sortKey="Sampels, Michael" sort="Sampels, Michael" uniqKey="Sampels M" first="Michael" last="Sampels">Michael Sampels</name><affiliation wicri:level="4"><country xml:lang="fr">Belgique</country><wicri:regionArea>Institut de Recherches Interdisciplinaires et de, Développements en Intelligence Artificielle, Université Libre de Bruxelles, 50, avenue Franklin D Roosevelt, CP 194/6, 1050, Bruxelles</wicri:regionArea><placeName><settlement type="city">Bruxelles</settlement><region nuts="2">Région de Bruxelles-Capitale</region></placeName><orgName type="university">Université libre de Bruxelles</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Belgique</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">80C13B196A6A102A54B8001200A112FD1D9D69A1</idno><idno type="DOI">10.1007/978-3-540-24669-5_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The transmission of a strongly connected digraph D is defined as the sum of all distances in D. A lower bound for the transmission in terms of the order n and the maximal outdegree Δ + of D can be regarded as a generalization of the Moore bound for digraphs. Bridges and Toueg showed that Moore digraphs in the strong sense exist only for the trivial cases Δ + =1 or Δ + =n-1. Using techniques founded on Cayley digraphs, we constructed vertex-symmetric generalized Moore digraphs. Such graphs are applicable to interconnection networks of parallel computers, routers, switches, backbones, etc.</div></front></TEI><affiliations><list><country><li>Belgique</li></country><region><li>Région de Bruxelles-Capitale</li></region><settlement><li>Bruxelles</li></settlement><orgName><li>Université libre de Bruxelles</li></orgName></list><tree><country name="Belgique"><region name="Région de Bruxelles-Capitale"><name sortKey="Sampels, Michael" sort="Sampels, Michael" uniqKey="Sampels M" first="Michael" last="Sampels">Michael Sampels</name></region><name sortKey="Sampels, Michael" sort="Sampels, Michael" uniqKey="Sampels M" first="Michael" last="Sampels">Michael Sampels</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000181 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000181 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:80C13B196A6A102A54B8001200A112FD1D9D69A1
|texte= On Generalized Moore Digraphs
}}
| This area was generated with Dilib version V0.6.31. |  |